Problem Solving for Chemistry (Peters, Edward I.)

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Problem Solving in Chemistry

When the first author began work in chemical education, he became interested in research on problem solving for several reasons. First, problem solving is what chemists do, regardless of whether they work in the area of synthesis, spectroscopy, theory, analysis, or the characterization of compounds. Second, it was clear that individuals who were successful in chemistry courses either developed ...

متن کامل

Non-Mathematical Problem Solving in Organic Chemistry

Differences in problem-solving ability among organic chemistry graduate students and faculty were studied within the domain of problems that involved the determination of the structure of a molecule from the molecular formula of the compound and a combination of IR and H NMR spectra. The participants’ performance on these tasks was compared across variables that included amount of research expe...

متن کامل

The Extensible Computational Chemistry Environment: A Problem Solving Environment for High Performance Theoretical Chemistry

The Extensible Computational Chemistry Environment (Ecce) is a suite of distributed applications that are integrated as a comprehensive problem solving environment for computational chemistry. Ecce provides scientists with an easily used graphical user interface to the tasks of setting up complex molecular modeling calculations, distributed use of high performance computers, and scientific visu...

متن کامل

An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Chemical Education

سال: 1977

ISSN: 0021-9584,1938-1328

DOI: 10.1021/ed054pa386.1